New upper bounds for neighbor searching

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Upper Bounds for Maximum -

We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use of Fischer's inequality with previously developed bounds. We demonstrate this in detail by using the partitioning idea to strengthen the spectral bounds of Ko, Lee and Queyranne and of Lee. Computat...

متن کامل

New Upper Bounds for MaxSat

We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove that MaxSat can be solved in time O(|F | · 1.3972), where |F | is the length of a formula F in conjunctive normal form and K is the number of clauses in F . We also prove the time bounds O(|F | · 1.3995), where k is the maximum number of satisfiable clauses, and O((1.1279) ) for ...

متن کامل

Non-zero probability of nearest neighbor searching

Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

متن کامل

New upper bounds on cross-validation for the k-Nearest Neighbor classification rule

The present work addresses binary classification by use of the k-nearest neighbors (kNN) classifier. Among several assets, it belongs to intuitive majority vote classification rules and also adapts to spatial inhomogeneity, which is particularly relevant in high dimensional settings where no a priori partitioning of the space seems realistic. However the performance of the kNN classifier crucia...

متن کامل

New bounds for sorting and searching

In today’s curricula for basic algorithms and data structures, comparison-based algorithms play by far the most central role. Algorithms based on other methods, like radix sorting and trie structures, are often overlooked or marginalised. However, some recent research findings give reason to question this situation. This article contains an overview of these results. Some experimental experienc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1986

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(86)80030-4